Moment Inequalities for Functions of Independent Random Variables by Stéphane Boucheron,1 Olivier Bousquet,
نویسنده
چکیده
A general method for obtaining moment inequalities for functions of independent random variables is presented. It is a generalization of the entropy method which has been used to derive concentration inequalities for such functions [Boucheron, Lugosi and Massart Ann. Probab. 31 (2003) 1583–1614], and is based on a generalized tensorization inequality due to Latała and Oleszkiewicz [Lecture Notes in Math. 1745 (2000) 147–168]. The new inequalities prove to be a versatile tool in a wide range of applications. We illustrate the power of the method by showing how it can be used to effortlessly re-derive classical inequalities including Rosenthal and Kahane–Khinchine-type inequalities for sums of independent random variables, moment inequalities for suprema of empirical processes and moment inequalities for Rademacher chaos and U -statistics. Some of these corollaries are apparently new. In particular, we generalize Talagrand’s exponential inequality for Rademacher chaos of order 2 to any order. We also discuss applications for other complex functions of independent random variables, such as suprema of Boolean polynomials which include, as special cases, subgraph counting problems in random graphs.
منابع مشابه
Moment inequalities for functions of independent random variables
A general method for obtaining moment inequalities for functions of independent random variables is presented. It is a generalization of the entropy method which has been used to derive concentration inequalities for such functions [7], and is based on a generalized tensorization inequality due to Lata la and Oleszkiewicz [25]. The new inequalities prove to be a versatile tool in a wide range o...
متن کاملConcentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal travelling salesmen tours, Steiner trees and the eigenvalues of random symmetric matrices. 1 Introduction Since its appearance in 1995 Talagrands convex distance inequali...
متن کاملEfron–Stein Inequalities for Random Matrices
This paper establishes new concentration inequalities for random matrices constructed from independent random variables. These results are analogous with the generalized Efron–Stein inequalities developed by Boucheron et al. The proofs rely on the method of exchangeable pairs. AMS 2000 subject classifications: Primary 60B20, 60E15; secondary 60G09, 60F10.
متن کاملMoment inequalities for sums of certain independent symmetric random variables
This paper gives upper and lower bounds for moments of sums of independent random variables (Xk) which satisfy the condition that P (|X|k ≥ t) = exp(−Nk(t)), where Nk are concave functions. As a consequence we obtain precise information about the tail probabilities of linear combinations of independent random variables for which N(t) = |t| for some fixed 0 < r ≤ 1. This complements work of Glus...
متن کاملA high-dimensional Wilks phenomenon
A theorem by Wilks asserts that in smooth parametric density estimation the difference between the maximum likelihood and the likelihood of the sampling distribution converges toward a chi-square distribution where the number of degrees of freedom coincides with the model dimension. This observation is at the core of some goodness-of-fit testing procedures and of some classical model selection ...
متن کامل